Augmenting Metaheuristics with Rewriting Systems
نویسندگان
چکیده
We describe the use of a rewriting system to determine equivalence classes over the search-space of optimisation problems. These equivalence classes may be used to derive redundant subsequences in the search-space for incorporation into metaheuristics such as backtracking, genetic algorithms and tabu-search. We use this approach as the basis for a new tabu-search variant — ‘EquationalTS’ and apply it to the Quadratic Assignment Problem, yielding significant results in terms of the number of iterations to convergence.
منابع مشابه
Metaheuristic Approaches to Lexical Substitution and Simplification
In this paper, we propose using metaheuristics—in particular, simulated annealing and the new D-Bees algorithm—to solve word sense disambiguation as an optimization problem within a knowledge-based lexical substitution system. We are the first to perform such an extrinsic evaluation of metaheuristics, for which we use two standard lexical substitution datasets, one English and one German. We fi...
متن کاملConstraint-Based Multi-Completion Procedures for Term Rewriting Systems
In equational theorem proving, convergent term rewriting systems play a crucial role. In order to compute convergent term rewriting systems, the standard completion procedure (KB) was proposed by Knuth and Bendix and has been improved in various ways. The multi-completion system MKB developed by Kurihara and Kondo accepts as input a set of reduction orders in addition to equations and efficient...
متن کاملComplex metaheuristics
Complexity is a prevalent feature of numerous natural and artificial systems and as such has attracted much scientific interest in the last decades. The pursuit of computational tools capable of analyzing, modeling or designing systems exhibiting this complex nature –in which the properties of the system are not evident at the bottom level but emerge from its global structure– is a major issue....
متن کاملOPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS
In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...
متن کاملDirect Aperture Optimization for Intensity Modulated Radiation Therapy: Two Calibrated Metaheuristics and Liver Cancer Case Study
Integrated treatment planning for cancer patients has high importance in intensity modulated radiation therapy (IMRT). Direct aperture optimization (DAO) is one of the prominent approaches used in recent years to attain this goal. Considering a set of beam directions, DAO is an integrated approach to optimize the intensity and leaf position of apertures in each direction. In this paper, first, ...
متن کامل